Some basic properties of multiple Hamiltonian covers
نویسندگان
چکیده
منابع مشابه
some properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولdetermination of some physical and mechanical properties red bean
چکیده: در این تحقیق، برخی خواص فیزیکی و مکانیکی لوبیا قرمز به-صورت تابعی از محتوی رطوبت بررسی شد. نتایج نشان داد که رطوبت بر خواص فیزیکی لوبیا قرمز شامل طول، عرض، ضخامت، قطر متوسط هندسی، قطر متوسط حسابی، سطح تصویر شده، حجم، چگالی توده، تخلخل، وزن هزار دانه و زاویه ی استقرار استاتیکی در سطح احتمال 1 درصد اثر معنی داری دارد. به طوری که با افزایش رطوبت از 54/7 به 12 درصد بر پایه خشک طول، عرض، ضخام...
15 صفحه اولSome Hamiltonian Properties of One-Conflict Graphs
Dirac’s and Ore’s conditions (1952 and 1960) are well known and classical sufficient conditions for a graph to contain a Hamiltonian cycle and they are generalized in 1976 by the Bondy-Chvtal Theorem. In this paper, we add constraints, called conflicts. A conflict in a graph G is a pair of distinct edges of G. We denote by (G, Conf) a graph G with a set of conflicts Conf . A path without confli...
متن کاملEnergy and Some Hamiltonian Properties of Graphs
We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow that in [2]. For a graph G = (V, E), n := |V |, e := |E|, and G := (V, E), where E := { xy : x ∈ V, y ∈ V, x = y, xy ∈ E }. For a bipartite graph GBPT = (X, Y ; E), GBPT := (X, Y ; E ), where E := { xy : x ∈ X, y ∈ Y, xy ∈ E }. The degree of vertex vi is denoted by di. The...
متن کامل'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers
A classical result, fundamental to evolutionary biology, states that an edge-weighted tree T with leaf set X, positive edge weights, and no vertices of degree 2 can be uniquely reconstructed from the leaf-to-leaf distances between any two elements of X. In biology, X corresponds to a set of taxa (e.g. extant species), the tree T describes their phylogenetic relationships, the edges correspond t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.03.035